Multiobjective Multicast Routing with Ant Colony Optimization
نویسندگان
چکیده
This work presents a multiobjective algorithm for multicast traffic engineering. The proposed algorithm is a new version of MultiObjective Ant Colony System (MOACS), based on Ant Colony Optimization (ACO). The proposed MOACS simultaneously optimizes the maximum link utilization, the cost of the multicast tree, the averages delay and the maximum end-to-end delay. In this way, a set of optimal solutions, known as Pareto set is calculated in only one run of the algorithm, without a priori restrictions. Experimental results obtained with the proposed MOACS were compared to a recently published Multiobjective Multicast Algorithm (MMA), showing a promising performance advantage for multicast traffic engineering.
منابع مشابه
Multicast computer network routing using genetic algorithm and ant colony
Due to the growth and development of computer networks, the importance of the routing topic has been increased. The importance of the use of multicast networks is not negligible nowadays. Many of multimedia programs need to use a communication link to send a packet from a sender to several receivers. To support such programs, there is a need to make an optimal multicast tree to indicate the opt...
متن کاملMulti-Objective Multicast Routing based on Ant Colony Optimization
This work presents a new multiobjective algorithm based on ant colonies, which is used in the construction of the multicast tree for data transmission in a computer network. The proposed algorithm simultaneously optimizes cost of the multicast tree, average delay and maximum end-to-end delay. In this way, a set of optimal solutions, know as Pareto set, is calculated in only one run of the algor...
متن کاملHybrid Optimization for Multiobjective Multicast Routing
The multicast routing protocol in Wireless Sensor Networks (WSN) must be energy aware since the nodes are energy constrained due to limited battery life. This gives rise to the need for efficient multicast routing protocol that is able to determine multicast routes which satisfies the quality of service guarantees and at the same time conserves energy. The transmission of real time multimedia s...
متن کاملMultiobjective Max-Min Ant System. An application to Multicast Traffic Engineering
Ant Colony Optimization (ACO) has been already established as a practical approach to solve single-objective combinatorial problems. This work proposes a new approach for the resolutions of Multi-Objective Problems (MOPs) inspired in Max-Min Ant System (MMAS). To probe our new approach, a multicast traffic-engineering problem was solved using the proposed approach as well as a Multiobjective Mu...
متن کاملA Comparative Study on Multicast Routing Using Dijkstra’s, Prims and Ant Colony Systems
Dijkstra’s and Prim’s algorithms are well established methods for implementing multicast routing. We have emphasized a different approach ’Ant Colony System (ACS)’ for multicast routing. This paper introduces a comparative study of implementing simple Ant Colony System, Dijkstra’s Algorithm and Prim’s Algorithm in a multicast routing communication scenario. For the sake of simplicity we have on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006